Iterative Smoothing of Curves and Surfaces
نویسنده
چکیده
Algorithms for drawing smooth curves and surfaces are well-known but may be too expensive in CPU time to use for certain high speed interactive graphics applications. This paper looks at some new geometrically-based smoothing algorithms that arrive at the final smooth curve or surface after the application of an infinite number of iterations of the algorithm using subdivision refinement. When CPU time is scarce low iteration counts can be used to provide an acceptable level of approximation of smoothness and when CPU time is more plentiful higher levels of iteration can be applied for greater visual smoothing accuracy. Three new algorithms are presented and analysed. Convergence is proved geometrically for each and their timings are reported. Mixing iterations provides new opportunities for achieving various different effects in curve and surface smoothing.
منابع مشابه
Developing fractal curves
Many fractal curves can be produced as the limit of a sequence of polygonal curves, where the curves are generated via an iterative process, for example an L-system. One can visualise such a sequences of curves as an animation that steps through the sequence. A small part of the curve at one step of the iteration is close to a corresponding part of the curve at the previous step, and so it is n...
متن کاملSmoothing Spline Curves and Surfaces for Sampled Data
We consider the problem of designing optimal smoothing spline curves and surfaces for a given set of discrete data. For constructing curves and surfaces, we employ normalized uniform B-splines as the basis functions. First we derive concise expressions for the optimal solutions in the form which can be used easily for numerical computations as well as mathematical analyses. Then, assuming that ...
متن کاملCurve and Surface Smoothing without Shrinkage
For a number of computational purposes, including visualization of scientific data and registration of multimodal medical data, smooth curves must be approximated by polygonal curves, and surfaces by polyhedral surfaces. An inherent problem of these approximation algorithms is that the resulting curves and surfaces appear faceted. Boundary-following and iso-surface construction algorithms are t...
متن کاملMulti-resolution Smoothing of Nurbs Curves Based on Non-uniform B-spline Wavelets
As a rule, an energy method is widely adopted for b-spline curve smoothing, but this method has the disadvantages such as massive calculation, computation complexity and low efficiency. Compared with the energy method, multi-resolution smoothing approaches nicely overcome these obstacles. Presently, some researches have been conducted on multi-resolution smoothing, but these efforts mainly aime...
متن کاملTENSION QUARTIC TRIGONOMETRIC BÉZIER CURVES PRESERVING INTERPOLATION CURVES SHAPE
In this paper simple quartic trigonometric polynomial blending functions, with a tensionparameter, are presented. These type of functions are useful for constructing trigonometricB´ezier curves and surfaces, they can be applied to construct continuous shape preservinginterpolation spline curves with shape parameters. To better visualize objects and graphics atension parameter is included. In th...
متن کامل